#include <bits/stdc++.h>
#include <string>
using namespace std;

int a[101];
int main()
{
    int n;
    cin >> n;
    a[0] = 101;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    // 当前序列的长度   总长度(最大值)
    int curLen = 0, maxLen = 1;
    for (int i = 1; i < n; i++)
    {
        if (a[i] <= a[i - 1])
        {
            if (curLen > maxLen)
                maxLen = curLen;
            curLen = 1;
        }
        else if (a[i] > a[i - 1])
            curLen++;
    }
    cout << maxLen;
    return 0;
}
